TASM: Top-k Approximate Subtree Matching

We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large document tree, e.g., DBLP with 26M nodes, using the canonical tree edit distance as a similarity measure between subtrees. Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runtime and quadratic space complexity, and, thus, do not scale. Our solution is TASMpostorder, a memory-efficient and scalable TASM algorithm. We prove an upper-bound for the maximum subtree size for which the tree edit distance needs to be evaluated. The upper bound depends on the query and is independent of the document size and structure. A core problem is to efficiently prune subtrees that are above this size threshold. We develop an algorithm based on the prefix ring buffer that allows us to prune all subtrees above the threshold in a single postorder scan of the document. The size of the prefix ring buffer is linear in the threshold. As a result, the space complexity of TASM-postorder depends only on k and the query size, and the runtime of TASM-postorder is linear in the size of the document. Our experimental evaluation on large synthetic and real XML documents confirms our analytic results. DOI: https://doi.org/10.1109/ICDE.2010.5447905 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-44570 Accepted Version Originally published at: Augsten, N; Böhlen, M; Barbosa, D; Palpanas, T (2010). TASM: Top-k Approximate Subtree Matching. In: IEEE 26th International Conference on Data Engineering (ICDE), 2010, Long Beach, California, USA, 1 March 2010 6 March 2010, 353-364. DOI: https://doi.org/10.1109/ICDE.2010.5447905 University of Zurich Zurich Open Repository and Archive Winterthurerstr. 190